Search results for "Bandwidth allocation"
showing 10 items of 10 documents
A Metaheuristic Bandwidth Allocation Scheme for FiWi Networks Using Ant Colony Optimization
2015
Optical-wireless access networks constitute a quite attractive solution to meet the ever-increasing bandwidth requirements of end-users, offering significant benefits such as ubiquitous coverage in the wireless domain and huge bandwidth in the optical domain. However, converging optical and wireless networking technologies, with Passive Optical Networks (PONs) and 4G wireless standards, such as the Worldwide Interoperability for Microwave Access (WiMAX) and the Long Term Evolution (LTE), entails major challenges that need to be addressed. In this context, designing an efficient and fair bandwidth distribution with Quality of Service (QoS) support is a difficult task due to the interdependen…
Non-cooperative available bandwidth estimation towards ADSL links
2008
Existing tools for the estimation of the end- to-end available bandwidth require control of both end hosts of the path and this significantly limits their usability. In this paper we present ABwProbe, a single-ended tool for available bandwidth estimation against non-cooperative hosts. Although ABwProbe is general enough to be used on any Internet path, we focus our attention on ADSL links exploring the possibility of measuring the downlink available bandwidth of a non-cooperative ADSL host. We study the effect of cross-traffic on the uplink, finding that only large packets may deteriorate ABwProbe's measurements and we present two techniques to detect and filter the effect of uplink cross-…
Bandwidth allocation and pricing in multimode network
2006
This paper presents adaptive resource sharing model that uses a revenue criterion to allocate network resources in an optimal way. The model ensures QoS requirements of data flows and, at the same time, maximizes the total revenue by adjusting parameters of the underlying scheduler. Besides, the adaptive model eliminates the need to find the optimal static weight values because they are calculated dynamically. The simulation consists of several cases that analyse the model and the way it provides the required QoS guarantees. The simulation reveals that the installation of the adaptive model increases the total revenue and ensures the QoS requirements for all service classes.
Congestion Avoidance Using DYnamic COdec MAnagement: A solution for ISP
2005
The large diffusion of VoIP is an essential key for the success of emerging Internet service providers. These ISPs conflict with the interests of historical and predominant network maintainers which often control the network infrastructure and telephone services. To win this competition, emerging ISPs have to adopt strategic QoS solutions which will capture the attention of network users and phone clients. This paper presents a solution which is able to obtain the same performance of a 64 Kbps channel reducing the costs for over-provisioning network bandwidth. DyCoMa is a mechanism studied for VoIP applications in network with a limited bandwidth for multimedia services. It works preventing…
<title>Statistical bandwidth allocation for multiservice networks</title>
2002
Multiservice networks will carry di erent kinds of applications in the near future. Bandwidth requirements change rapidly, and the network resource management will play an important role to guarantee the use of the limited resources in the most eAEcient way. We approach the channel capacity allocation problem by developing an SLA (Service Level Agreement) based channel allocation method. In our model, the channel may be wired or wireless, so this method can be adapted in multi-technique networks. The algorithm allocates resources to several di erent service classes via several di erent capacity routes. Service provider perfroms optimization by allocating data rate in such a way that the sat…
Bandwidth Resource Management for Neural Signal Telemetry
2009
Recent advances in modern neurocomputing have shown the utmost necessity of wireless communication systems that allow real-time (RT) monitoring of neural signals meeting several requirements such as source compression and high fidelity of the received signal. Neural recordings require multielectrode probes with up to hundreds of electrodes and transmission of signals wirelessly over a limited bandwidth (BW). In this paper, a RT resource management algorithm is proposed so that adequate source compression is applied to each channel in order to fit them into the available BW. Performance of the algorithm is analyzed using dynamically changing BW and neural recordings with different neural act…
User bandwidth usage-driven HNN neuron excitation method for maximum resource utilization within packet-switched communication networks
2006
Mobile and wireless systems beyond 3G are being designed under the user-centric paradigm. Dynamic resource allocation (DRA) is a topic on intensive research to address efficiently such paradigm. Hopfield neural networks (HNN) have proved useful in the past to solve this kind of complex optimization problems. Recently, various approaches have been proposed to realize HNN-based user-centric DRA. However, the initial algorithms suffer from severe instability problems impacting the overall performance. This letter analyses the source of the existing limitations and proposes an enhanced formulation, ensuring maximum resource utilization while optimizing the convergence of the neural network. The…
Parallel and Distributed Resource Allocation With Minimum Traffic Disruption for Network Virtualization
2017
Wireless network virtualization has been advocated as one of the most promising technologies to provide multifarious services and applications for the future Internet by enabling multiple isolated virtual wireless networks to coexist and share the same physical wireless resources. Based on the multiple concurrent virtual wireless networks running on the shared physical substrate, service providers can independently manage and deploy different end-users services. This paper proposes a new formulation for bandwidth allocation and routing problem for multiple virtual wireless networks that operate on top of a single substrate network to minimize the operation cost of the substrate network. We …
Achieving Fair Bandwidth Distribution in WiFi Networks: A Game Theoretical Approach
2011
International audience; Achieving fair bandwidth distribution among uplink and downlink ows in IEEE 802.11 infrastructure networks is a complex issue, due to the well-known features of the Distributed Coordination Function (DCF) which regulates the access to the shared medium. Indeed, the dynamic adaptation of the contention windows causes phenomena of short-term unfairness, while the use of homogeneous contention parameters among the contending nodes makes the aggregated downlink bandwidth equal to the uplink bandwidth of a single node. We propose a dynamic tuning of the contention parameters used by the nodes, based on simple network monitoring functionalities and rational strategies. Spe…
On Unstructured File Sharing Networks
2007
We study the interaction among users of unstructured file sharing applications, who compete for available network resources (link bandwidth or capacity) by opening multiple connections on multiple paths so as to accelerate data transfer. We model this interaction with an unstructured file sharing game. Users are players and their strategies are the numbers of sessions on available paths. We consider a general bandwidth sharing framework proposed by Kelly [1] and Mo and Walrand [2], with TCP as a special case. Furthermore, we incorporate the Tit-for-Tat strategy (adopted by BitTorrent [3] networks) into the unstructured file sharing game to model the competition in which a connection can be …